Personalized Pareto-improving pricing-and-routing schemes for near-optimum freight routing: An alternative approach to congestion pricing
نویسندگان
چکیده
We design a coordination mechanism for truck drivers that uses pricing-and-routing schemes can help alleviate traffic congestion in general transportation network. consider the user heterogeneity Value-Of-Time (VOT) by adopting multi-class model with stochastic Origin-Destination (OD) demands drivers. The main characteristic of is coordinator asks to declare their desired OD pair and pick individual VOT from set $N$ available options, guarantees resulting scheme Pareto-improving, i.e. every driver will be better-off compared User Equilibrium (UE) have an incentive truthfully his/her VOT, while leading revenue-neutral (budget balanced) on average mechanism. This approach enables us personalized (VOT-based) schemes. show Optimum Pricing Scheme (OPS) calculated solving nonconvex optimization problem. To improve computational efficiency, we propose Approximately (AOPS) prove it satisfies aforementioned properties. Both are Congestion Uniform Revenue Refunding (CPURR) through extensive simulation experiments where shown OPS AOPS achieve much lower expected total travel time monetary cost users CPURR scheme, without negatively affecting rest These results demonstrate efficiency
منابع مشابه
Simultaneous Pricing, Routing, and Inventory Control for Perishable Goods in a Two-echelon Supply Chain
Due to the rapid development of technology in recent years, market competition and customer expectations have increased more than ever. In this situation, it is vital for businesses survival to determine the appropriate policy for inventory control, pricing, and routing, and decisions regarding each of them are often made separately. If the products have a perishable nature, it will be more imp...
متن کاملPricing Networks with Selfish Routing∗
We study the negative consequences of selfish behavior in networks and economic means of influencing such behavior. We focus on a simple model of selfish routing, defined by Wardrop [12] and first studied from a theoretical computer science perspective by Roughgarden and Tardos [10]. In this model, we are given a directed network in which each edge possesses a latency function, describing the c...
متن کاملPricing Granularity for Congestion-Sensitive Pricing
One of the key issues for implementing congestion pricing is the pricing granularity (i.e. pricing interval or timescale). The Internet traffic is highly variant and hard to control without a mechanism that operates on very low time-scales, i.e. on the order of round-trip-times (RTTs). However, pricing naturally operates on very large timescales because of human involvement. Moreover, structure...
متن کاملPareto-improving congestion pricing and revenue refunding with multiple user classes
This study investigates Pareto-improving congestion pricing and revenue refunding schemes in general transportation networks, which make every road user better off as compared with the situation without congestion pricing. We consider user heterogeneity in value of time (VOT) by adopting a multiclass user model with fixed origin-destination (OD) demands. We first prove that an OD and class-base...
متن کاملCongestion Pricing for Congestion Avoidance
This paper describes the use of Congestion Pricing as a means of providing Congestion Control and Di erentiated Quality of Service. The application of the proposed technique to the Internet Protocol has the advantage that it can be simply implemented using Explicit Congestion Noti cation. In particular: the network mechanism is independent of higher level protocols; the end systems can continue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part C-emerging Technologies
سال: 2021
ISSN: ['1879-2359', '0968-090X']
DOI: https://doi.org/10.1016/j.trc.2021.103004